Statistical Properties of Digital Piecewise Linear Chaotic Maps and Their Roles in Cryptography and Pseudo-Random Coding
نویسندگان
چکیده
The applications of digital chaotic maps in discrete-time chaotic cryptography and pseudo-random coding are widely studied recently. However, the statistical properties of digital chaotic maps are rather different from the continuous ones, which impedes the theoretical analyses of the digital chaotic ciphers and pseudo-random coding. This paper detailedly investigates the statistical properties of a class of digital piecewise linear chaotic map (PLCM), and rigorously proves some useful results. Based on the proved results, we further discuss some notable problems in chaotic cryptography and pseudo-random coding employing digital PLCM-s. Since the analytic methods proposed in this paper can essentially extended to a large number of PLCM-s, they will be valuable for the research on the performance of such maps in chaotic cryptography and pseudo-random coding.
منابع مشابه
On the Dynamical Degradation of Digital Piecewise Linear Chaotic Maps
When chaotic systems are realized with finite precisions in digital computers, their dynamical properties are often found to be entirely different from the original versions in the continuous setting. In the literature, there does not seem to be much work on quantitative analysis of such degradation of digitized chaos and how to reduce its negative influence on chaos-based digital systems. Focu...
متن کاملEfficient implementation of pseudochaotic piecewise linear maps with high digitization accuracies
In this paper we discuss the efficient implementation of pseudochaotic piecewise linear maps with high digitization accuracies, taking the Rényi chaotic map as a reference. The proposed digital architectures are based on a novel algorithmic approach, that uses carry save adders for the nonlinear arithmetic modular calculations arising when computing piecewise linear maps with a finite precision...
متن کاملA Very Efficient Pseudo-Random Number Generator Based On Chaotic Maps and S-Box Tables
Generating random numbers are mainly used to create secret keys or random sequences. It can be carried out by various techniques. In this paper we present a very simple and efficient pseudo random number generator (PRNG) based on chaotic maps and S-Box tables. This technique adopted two main operations one to generate chaotic values using two logistic maps and the second to transform them into ...
متن کاملWatermarking Scheme Based on Multiple Chaotic Maps
a watermarking scheme for Grayscale image isproposed based on a family of the chaotic maps and discretecosine transform. Jacobian Elliptic mapis employed to encrypt ofwatermarked logo. Piecewise nonlinear chaotic map is also usedto determine the location of DCT coefficients for the watermarkembedding. The purpose of this algorithm is to improve theshortcoming of watermarking such as small key s...
متن کاملA New Pseudo-Random Number Generator Based on Two Chaotic Maps
A new pseudo-random number generator (PRNG) is proposed. The principle of the method consists in mixing chaotic maps produced from an input initial vector. The algorithm uses permutations whose positions are computed and indexed by a chaotic function based on linear congruences. The performance of this scheme is evaluated through statistical analysis. Such a cryptosystem lets appear significant...
متن کامل